Neville's algorithm revisited
نویسنده
چکیده
Neville’s algorithm is known to provide an efficient and numerically stable solution for polynomial interpolations. In this paper, an extension of this algorithm is presented which includes the derivatives of the interpolating polynomial.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملSolving delay differential equations by the five-point one-step block method using Neville's interpolation
A five-point one-step block method based on the Newton backward divided difference formulae for the solution of first-order delay differential equations is derived. The proposed block method will approximate the solutions of initial value problems at five points simultaneously using variable step size. The approximation of the delay term is calculated using Neville's interpolation. The block me...
متن کاملNew Iterative Methods for Interpolation, Numerical Differentiation and Numerical Integration
Through introducing a new iterative formula for divided difference using Neville's and Aitken's algorithms, we study new iterative methods for interpolation, numerical differentiation and numerical integration formulas with arbitrary order of accuracy for evenly or unevenly spaced data. Basic computer algorithms for new methods are given.
متن کاملA fast and accurate algorithm for solving Bernstein–Vandermonde linear systems
A fast and accurate algorithm for solving a Bernstein-Vandermonde linear system is presented. The algorithm is derived by using results related to the bidiagonal decomposition of the inverse of a totally positive matrix by means of Neville elimination. The use of explicit expressions for the determinants involved in the process serves to make the algorithm both fast and accurate.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.06293 شماره
صفحات -
تاریخ انتشار 2017